Synthesis-Guided Partial Hierarchy Collapsing
نویسندگان
چکیده
This paper presents a framework for analyzing distribution of sequentially equivalent nodes in a hierarchical design. This information can be used for selectively collapsing hierarchical modules into 'super-modules' resulting in improved optimization and better placement decisions. Our framework is capable of comparing any two modules in the design hierarchy in terms of logic sharing. Our current implementation is based on ABC and Verific, and we are reporting preliminary result of our experiments.
منابع مشابه
Use of Hierarchy in Fault Collapsing
We discuss the advantage of using hierarchy in testing. Our demonstration is based on the problem of fault collapsing. Though this problem is not considered to be too complex, the time of collapsing faults in moderately large circuits can be several hours or more. This can be considerably shortened by hierarchical fault collapsing. Large circuits are efficiently described using hierarchy, which...
متن کاملUsing Hierarchy in Design Automation: The Fault Collapsing Problem
Although the problem of fault collapsing is not considered to be too complex, the time of collapsing faults in large circuits can be several hours or more. Large circuits are efficiently described using hierarchy, which significantly helps the architectural design, verification and physical design. We add fault collapsing to that list. We do not flatten the circuit and the collapsed fault sets ...
متن کاملCollapsing Exact Arithmetic Hierarchies
We provide a uniform framework for proving the collapse of the hierarchy NC(C) for an exact arithmetic class C of polynomial degree. These hierarchies collapse all the way down to the third level of the AC-hierarchy, AC3(C). Our main collapsing exhibits are the classes C ∈ {C=NC,C=L,C=SAC,C=P}. NC(C=L) and NC(C=P) are already known to collapse [1,18,19]. We reiterate that our contribution is a ...
متن کاملA Note on the Karp-Lipton Collapse for the Exponential Hierarchy
We extend previous collapsing results involving the exponential hierarchy by using recent hardness-randomness trade-off results. Specifically, we show that if the second level of the exponential hierarchy has polynomialsized circuits, then it collapses all the way down to MA.
متن کاملConstructing Oracles by Lower Bound Techniques for Circuits
Separating or collapsing complexity hierarchies has always been one of the most important problems in complexity theory. For most interesting hierarchies, however, we have been so far unable to either separate them or collapse them. Among these unsolvable questions, whether P equals NP is perhaps the most famous one. In view of the fundamental difficulty of these questions, a less interesting b...
متن کامل